Two dimensional optimal transportation problem for a distance cost with a convex constraint

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mathematical programs with a two-dimensional reverse convex constraint

We consider the problem min{f(x) : x E G, T(x) tI. int D}, where fis a lower semicontinuous function, G a compact, nonempty set in JRn, D a closed convex set in JR2 with nonempty interior, and T a continuous mapping from JRn to JR2. The constraint T( x) tI. int D is areverse convex constraint, so the feasible domain may be disconnected even when f, T are affine and G is a polytope. We show that...

متن کامل

Regularity for the Optimal Transportation Problem with Euclidean Distance Squared Cost on the Embedded Sphere

We give a sufficient condition on initial and target measures supported on the sphere S to ensure the solution to the optimal transport problem with the cost |x−y| 2 2 is a diffeomorphism.

متن کامل

The Decomposition of Optimal Transportation Problems with Convex Cost

Given a positive l.s.c. convex function c : Rd → R and an optimal transference plane π for the transportation problem ∫ c(x′ − x)π(dxdx′), we show how the results of [6] on the existence of a Sudakov decomposition for norm cost c = | · | can be extended to this case. More precisely, we prove that there exists a partition of Rd into a family of disjoint sets {Sh a }h,a together with the projecti...

متن کامل

A New Model for Transportation Problem with Qualitative Data

 In today’s highly competitive market, the pressure on organizations to find a better way to create and deliver value to customers is mounting. The decision involves many quantitative and qualitative factors that may be conflicting in nature. Here, we present a new model for transportation problem with consideration of quantitative and qualitative data. In the model, we quantify the qua...

متن کامل

A New Approach for Finding an Optimal Solution for Grey Transportation Problem

In ordinary transportation problems, it is always supposed that the mileage from every source to every destination is a definite number. But in special conditions, such as transporting emergency materials when natural calamity occurs or transporting military supplies during wartime, carrying network may be destroyed, mileage from some sources to some destinations are no longer definite. It is u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ESAIM: Control, Optimisation and Calculus of Variations

سال: 2013

ISSN: 1292-8119,1262-3377

DOI: 10.1051/cocv/2013045